Transfinite progressions: a second look at completeness

نویسنده

  • Torkel Franzén
چکیده

1. Iterated Gödelian extensions of theories. The idea of iterating ad infinitum the operation of extending a theory T by adding as a new axiom a Gödel sentence for T , or equivalently a formalization of “T is consistent”, thus obtaining an infinite sequence of theories, arose naturally when Gödel’s incompleteness theorem first appeared, and occurs today to many non-specialists when they ponder the theorem. In the logical literature this idea has been thoroughly explored through two main approaches. One is that initiated by Turing in his “ordinal logics” (see Gandy and Yates [2001]) and taken very much further in Feferman’s work on transfinite progressions, which also introduced the more general study of extensions by reflection principles, of which consistency statements are a special case. This approach starts from an assignment of theories to ordinal notations, and extracts sequences of theories through a suitable choice of a path in the set of ordinal notations. The second approach, illustrated in particular by the work of Schmerl and Beklemishev, starts instead from a suitably well-behaved primitive recursive well-ordering, which is used to define a sequence of theories. This second approach has led to precise results about the relative proof-theoretical strength of sequences of theories obtained by iterating different reflection principles. The Turing-Feferman approach, on the other hand, lends itself well to an investigation in qualitative and philosophical terms of the relevance of such iterated reflection extensions to mathematical knowledge, in particular because of two developments associated with this approach. First, there is Feferman’s famous completeness theorem for transfinite progressions based on full (uniform) reflection, which exercises a powerful appeal on the imagination, but which (perhaps because of the somewhat inaccessible character of Feferman [1962b]) is not widely known in any detail. Second, there is the concept of the autonomous part of a progression, introduced by Kreisel and Feferman, which allows us to reason in qualitative terms about what it is we do know, potentially at least, on the basis of iterated reflection principles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyperations, Veblen progressions and transfinite iteration of ordinal functions

In this paper we introduce hyperations and cohyperations, which are forms of transfinite iteration of ordinal functions. Hyperations are iterations of normal functions. Unlike iteration by pointwise convergence, hyperation preserves normality. The hyperation 〈f 〉ξ∈On of a normal function f is a sequence of normal functions so that f 0 = id, f 1 = f and for all α, β we have that f = ff. These co...

متن کامل

Autonomous fixed point progressions and fixed point transfinite recursion

This paper is a contribution to the area of metapredicative proof theory. It continues recent investigations on the transfinitely iterated fixed point theories ÎDα (cf. [10]) and addresses the question of autonomity in iterated fixed point theories. An external and an internal form of autonomous generation of transfinite hierarchies of fixed points of positive arithmetic operators are introduce...

متن کامل

Some Remarks on Transfinite E-Semantic Trees and Superposition

We prove the refutational completeness of Pmep by proof techniques employed in establishing the completeness of weak superposition [9]. By giving a counter-example we show that the same approach is impossible wrt. Peqf . Hence, this result shows a semantic differences between Pmep and Peqf . We apply the result to Automated Model Building.

متن کامل

A Rapidly Convergent Nonlinear Transfinite Element Procedure for Transient Thermoelastic Analysis of Temperature-Dependent Functionally Graded Cylinders

In the present paper, the nonlinear transfinite element procedure recently published by the author is improved by introducing an enhanced convergence criterion to significantly reduce the computational run-times. It is known that transformation techniques have been developed mainly for linear systems, only. Due to using a huge number of time steps, employing the conventional time integration me...

متن کامل

Girth and Chromatic Number of Graphs

This paper will look at the relationship between high girth and high chromatic number in both its finite and transfinite incarnations. On the one hand, we will demonstrate that it is possible to construct graphs with high oddgirth and high chromatic number in all cases. We will then look at a theorem which tells us why, at least in the transfinite case, it is impossible to generalize this to in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of Symbolic Logic

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2004